#include <iostream>
#include "2Tree.h"

using namespace std;

////template<class K>
//Node<K> fff()
//{
//	K a;
//	while(scanf("&d",&a)!=EOF)
//	{
//		Node<K> root = new Node(a);
//
//	}
//}
void ff(Node<int>*& root)
{
	Node<int>* tmp1 = new Node<int>(1);
	root = tmp1;
	Node<int>* tmp2 = new Node<int>(2);
	Node<int>* tmp3 = new Node<int>(3);
	tmp1->_left = tmp2;
	tmp1->_right = tmp3;	
	Node<int>* tmp4 = new Node<int>(4);
	Node<int>* tmp5 = new Node<int>(5);
	Node<int>* tmp6 = new Node<int>(6);
	Node<int>* tmp7 = new Node<int>(7);
	tmp2->_left = tmp4;
	tmp2->_right = tmp5;
	tmp3->_left = tmp6;
	tmp3->_right = tmp7;

}
int main()
{
	Node<int>* root;
	ff(root);
	//::vector<int> a = Tree2_2(root);
	//::vector<int> a = Tree2_zhong(root);
	::vector<int> a = Tree2_hou(root);

	return 0;

}